Words with unbounded periodicity complexity
نویسنده
چکیده
If an infinite non-periodic word is uniformly recurrent or is of bounded repetition, then the limit of its periodicity complexity is infinity. Moreover, there are uniformly recurrent words with the peri-odicity complexity arbitrarily high at infinitely many positions.
منابع مشابه
On the nature of solutions of the difference equation $mathbf{x_{n+1}=x_{n}x_{n-3}-1}$
We investigate the long-term behavior of solutions of the difference equation[ x_{n+1}=x_{n}x_{n-3}-1 ,, n=0 ,, 1 ,, ldots ,, ]noindent where the initial conditions $x_{-3} ,, x_{-2} ,, x_{-1} ,, x_{0}$ are real numbers. In particular, we look at the periodicity and asymptotic periodicity of solutions, as well as the existence of unbounded solutions.
متن کاملOn Periodicity and Complexity of Generalized Pseudostandard Words
Generalized pseudostandard words have been introduced by de Luca and De Luca in [7]. In comparison to the palindromic and pseudopalindromic closure, only little is known about the generalized pseudopalindromic closure and the associated generalized pseudostandard words. We present two new results concerning these words. The first one is a necessary and sufficient condition for their periodicity...
متن کاملA uniqueness and periodicity result for solutions of elliptic equations in unbounded domains
We proof a uniqueness and periodicity theorem for bounded solutions of uniformly elliptic equations in certain unbounded domains.
متن کاملAutomata on Gauss Words
In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams represented by Gauss words. Due to the fact the number of crossing in knots is unbounded, the Gauss words of knot diagrams are strings over infinite (unbounded) alphabet. For establishing the lower and upper bounds on rec...
متن کاملToeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract)
We consider so-called Toeplitz words which can be viewed as generalizations of one-way innnite periodic words. We compute their subword complexity, and show that they can always be generated by iterating periodically a nite number of morphisms. Moreover, we deene a structural classiication of Toeplitz words which is reeected in the way how they can be generated by iterated morphisms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJAC
دوره 24 شماره
صفحات -
تاریخ انتشار 2014